Wait-Free Stabilizing Dining Using Regular Registers
نویسندگان
چکیده
Dining philosophers is a scheduling paradigm that determines when processes in a distributed system should execute certain sections of their code so that processes do not execute ‘conflicting’ code sections concurrently, for some application-dependent notion of a ‘conflict’. Designing a stabilizing dining algorithm for shared-memory systems subject to process crashes presents an interesting challenge: classic stabilization relies on all processes continuing to execute actions forever, an assumption which is violated when crash failures are considered. We present a dining algorithm that is both wait-free (tolerates any number of crashes) and is pseudo-stabilizing. Our algorithm works in an asynchronous system in which processes communicate via shared regular registers and have access to the eventually perfect failure detector ♦P. Furthermore, with a stronger failure detector, the solution becomes wait-free and self-stabilizing. To our knowledge, this is the first such algorithm. Prior results show that ♦P is necessary for wait-freedom.
منابع مشابه
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every execution after a transient memory failure is linearizable except for an a priori bounded number of actions. Shared registers have been used extensively as communication medium in self-stabilizing protocols. As an application of...
متن کاملFault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The construction is in two steps: one implements a regular register using 1-regular registers, and the other implements a 1-regular register using saferegisters. In both steps, if the initial register is bounded then the implementati...
متن کاملFault-tolerant Implementations of regular Registers by safe Registers in Link Model
A network that uses locally shared registers can be modelled by a graph where nodes represent processors and there is an edge between two nodes if and only if the corresponding processors communicate directly by reading or writing registers shared between them. Two variants are defined by A variant of the model assumes that registers are singlewriter/single-reader and are located on the edges (...
متن کاملWait-Free Dining Under Eventual Weak Exclusion
We present a wait-free solution to the generalized dining philosophers problem under eventual weak exclusion in environments subject to crash faults. Wait-free dining guarantees that every correct hungry process eventually eats, regardless of process crashes. Eventual weak exclusion (3WX ) actually allows scheduling mistakes, whereby mutual exclusion may be violated finitely-many times; for eac...
متن کاملStabilizing Dining with Failure Locality 1
The dining philosophers problem, or simply dining, is a fundamental distributed resource allocation problem. In large scale and longlived systems, the likelihood of some process failing at some point is high, thus sparking interest in fault-tolerant versions of dining. We propose two algorithms for solving stabilizing dining with failure locality 1 in asynchronous shared-memory systems with reg...
متن کامل